Rough set reasoning using answer set programs

نویسندگان

چکیده

Reasoning about uncertainty is one of the main cornerstones Knowledge Representation. Formal representations are numerous and highly varied due to different types intended be modeled such as vagueness, imprecision incompleteness. There a rich body theoretical results that has been generated for many these approaches. It often case though, pragmatic tools reasoning with lag behind this results. Rough set theory approach modeling incompleteness based on indiscernibility its generalizations. In paper, we provide tool constructively generalized rough approximations use Answer Set Programming (Asp). We an interpretation answer sets (generalized) crisp (when possible) show how Asp solvers situated in realistic knowledge bases. The paper includes generic templates doing also provides study showing techniques can used generate reducts incomplete information systems. Complete, ready run clingo code provided Appendix, all programs considered. These executed validation purposes solver.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manifold Answer-Set Programs for Meta-reasoning

In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple reasoning over answer sets is sometimes supported by ASP systems (usually in the form of computing brave or cautious consequences), but slightly more involved reasoning problems require external postprocessing. Generally speaking...

متن کامل

Communicating Answer Set Programs

Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for representing and reasoning with the combined answer set programs of multiple agents have already been proposed, the actual gain in expressivity when adding communication has not been thoroughly studied. We show that allowing ...

متن کامل

Synthesizing Concurrent Programs using Answer Set Programming

We address the problem of the automatic synthesis of concurrent programs within a framework based on Answer Set Programming (ASP). The concurrent program to be synthesized is specified by providing both the behavioural and the structural properties it should satisfy. Behavioural properties, such as safety and liveness properties, are specified by using formulas of the Computation Tree Logic, wh...

متن کامل

Combining Answer Set Programs for Adaptive and Reactive Reasoning

In this paper we present a method to improve efficiency of ASP based system in dynamic context. Our proposal is a reasoning framework based on combination of ASP modules. This framework can be seen as a tool to assist the development of ASP based systems. Our final goal is to provide a general design pattern to help construction of efficient ASP based reasoning systems. In this paper, we first ...

متن کامل

Debugging Inconsistent Answer Set Programs

In this paper we examine how we can find contradictions from Answer Set Programs (ASP). One of the most important phases of programming is debugging, finding errors that have crept in during program implementation. Current ASP systems are still mostly experimental tools and their support for debugging is limited. This paper addresses one part of ASP debugging, finding the reason why a program d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2021

ISSN: ['1873-4731', '0888-613X']

DOI: https://doi.org/10.1016/j.ijar.2020.12.010